Derivation tree analysis for accelerated fixed-point computation
نویسندگان
چکیده
منابع مشابه
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f (X) is equal to the least fixed-point of a linear system obtained by “linearizing” the polynomials of f in a certain way. Our proofs rely on derivation tree analysis, a proof principle that combines methods from algebra, calculus, and formal language theory, and was first use...
متن کاملProgram Derivation by Fixed Point Computation
Thrs paper develops a transformational paradrgm by which nonnumertcal algorrthms are treated as fixed pomt computatrons derived from very htgh level problem specrficatrons We begin by presenting an abstract functronal problem specrficatron language SQ’, which 1s shown to express any partial recursive function m a fixed pomt normal form Next, we gtce a nondetermuusttc Iterative schema that rn th...
متن کاملSolving Fixed-Point Equations by Derivation Tree Analysis
Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.
متن کاملIterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an “on-line” constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normalized constraints he establishes that every program expression has a unique, most precise (“minimal”) strictness judgement, given fixed values for the strictness annotation in negative position. We show that his on-line normalizati...
متن کاملAccelerated Distance Computation with Encoding Tree for High Dimensional Data
We propose a novel distance to calculate distance between high dimensional vector pairs, utilizing vector quantization generated encodings. Vector quantization based methods are successful in handling large scale high dimensional data. These methods compress vectors into short encodings, and allow efficient distance computation between an uncompressed vector and compressed dataset without decom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.020